Testing Monte - Carlo Global Illumination Methods with Analytically Computable

Testing Monte-Carlo Global Illumination Methods with Analytically Computable Scenes

Quasi-Monte Carlo Methods in Computer Graphics: The Global Illumination Problem

The main part of the global illumination problem of computer graphics is given by a Fredholm integral equation of the second kind, describing the light distribution in a closed environment. Calculating photorealistic images from that equation requires its kernel to be very complex and discontinuous. Due to this complexity Monte Carlo methods are an interesting tool for estimating a solution. In...

Markov Chain Monte Carlo Methods for Global Illumination

Infrared ship signature prediction using measured BRDF data and global illumination rendering

Current IR ship signature codes have some limitations in predicting ship IR signatures. They either model general BRDF while ignoring multi-reflections, or compute multi-reflections with simplified BRDF models. We propose a new Monte Carlo ray tracing method incorporating measured BRDF data, which can calculate multi-reflections with general BRDF data. Much works have been done in computer grap...

Monte-Carlo Global Illumination Methods State of the Art and New Developments

This paper presents the state of the art and recent developments of Monte-Carlo global illumination algorithms. First it surveys the basic tasks of global illumination, which can be formulated as the solution of either the rendering or the potential equation, then reviews the basic solution techniques, including inversion, expansion and iteration. The paper explains why stochastic approaches ar...